Occlusion Culling Using Prioritized Visibility Queries
نویسندگان
چکیده
Part of the latest research efforts in occlusion culling focus on using hardware visibility query. In this paper, we present a novel method to prioritize the visibility query to work effectively together with an occlusion culling approach. We demonstrate that an addition of query priority to a simple front-to-back slab visibility processing can greatly reduce the number of unfruitful visibility query in occlusion culling computations. We also demonstrate how to make use of frame coherence in both cases of visibility query pass/fail to enhance the effectiveness of visibility culling technique. Combining with a typical occlusion culling method, we have applied our approach to several scenes with different structure complexes and the results have shown the effectiveness of the approach in minimizing the amount of non-essential visibility queries, hence improve overall performance of rendering system.
منابع مشابه
OpenGL-assisted Visibility Queries of Large Polygonal Models
We present an OpenGL-assisted visibility culling algorithm to improve the rendering performance of large polygonal models. Using a combination of OpenGL-assisted frustum culling, hierarchical model-space partitioning, and OpenGL based occlusion culling, we achieve a significant better performance on general polygonal models than previous approaches. In contrast to these approaches, we only expl...
متن کاملCHC++: Coherent Hierarchical Culling Revisited
We present a new algorithm for efficient occlusion culling using hardware occlusion queries. The algorithm significantly improves on previous techniques by making better use of temporal and spatial coherence of visibility. This is achieved by using adaptive visibility prediction and query batching. As a result of the new optimizations the number of issued occlusion queries and the number of ren...
متن کاملEfficient Conservative Visibility Culling Using the Prioritized-Layered Projection Algorithm
We propose a novel conservative visibility culling technique based on the Prioritized-Layered Projection (PLP) algorithm. PLP is a time-critical rendering technique that computes, for a given viewpoint, a partially correct image by rendering only a subset of the geometric primitives, those that PLP determines to be mostly likely visible. Our new algorithm builds on PLP and provides an efficient...
متن کاملOpenGL-assisted occlusion culling for large polygonal models
We present an OpenGL-assisted visibility culling algorithm to improve the rendering performance of large polygonal models. Using a combination of hierarchical model-space partitioning, OpenGL-assisted view-frustum culling, and OpenGL-assisted occlusion culling, we achieve a significantly better performance on general polygonal models than previous approaches. In contrast to these approaches, we...
متن کاملTowards Adaptive Occlusion Culling in Real-Time Rendering
The performance of real-time graphical simulations may suffer due to the lack of resources needed to render very large and complex virtual environments. In these situations the use of occlusion culling techniques enables the removal of occluded geometry, thus decreasing the amount of work sent to the graphics hardware to generate the image presented to the user. Recent approaches use the Hardwa...
متن کامل